Globally Convergent Levenberg-marquardt Method for Phase Retrieval
نویسندگان
چکیده
In this paper, we consider a nonlinear least squares model for the phase retrieval problem. Since the Hessian matrix may not be positive definite and the Gauss-Newton (GN) matrix is singular at any optimal solution, we propose a modified Levenberg-Marquardt (LM) method, where the Hessian is substituted by a summation of the GN matrix and a regularization term. Similar to the well-known Wirtinger flow (WF) algorithm under certain assumptions, we start from an initial point provably close to the set of the global optimal solutions. Global linear convergence and local quadratic convergence to the global solution set are proved by estimating the smallest nonzero eigenvalues of the GN matrix, establishing local error bound properties and constructing a modified regularization condition. The computational cost becomes tractable if a preconditioned conjugate gradient (PCG) method is applied to solve the LM equation inexactly. Specifically, the pre-conditioner is constructed from the expectation of the LM coefficient matrix by assuming the independence between the measurements and iteration point. Preliminary numerical experiments show that our algorithm is robust and it is often faster than the WF method on both random examples and natural image recovery.
منابع مشابه
, Vol1. No.1, JIC, Journal of Informaiton and Computing Science
A new method for the solution of the generalized complementarily problem is introduced. The method is based on a no smooth equation reformulation of the generalized complementarily problem and on a no smooth Levenberg-Marquardt method for its solution. The method is shown to be globally convergent. Numerical results are also given.
متن کاملSpectral Projected Gradient Method for the Procrustes Problem
We study and analyze a nonmonotone globally convergent method for minimization on closed sets. This method is based on the ideas from trust-region and Levenberg-Marquardt methods. Thus, the subproblems consists in minimizing a quadratic model of the objective function subject to a given constraint set. We incorporate concepts of bidiagonalization and calculation of the SVD “with inaccuracy” to ...
متن کاملLevenberg-Marquardt Method for the Eigenvalue Complementarity Problem
The eigenvalue complementarity problem (EiCP) is a kind of very useful model, which is widely used in the study of many problems in mechanics, engineering, and economics. The EiCP was shown to be equivalent to a special nonlinear complementarity problem or a mathematical programming problem with complementarity constraints. The existing methods for solving the EiCP are all nonsmooth methods, in...
متن کاملOn Levenberg-Marquardt Kaczmarz regularization methods for ill-posed problems
We investigate modified Levenberg-Marquardt methods coupled with a Kaczmarz strategy for obtaining stable solutions of nonlinear systems of ill-posed operator equations. We show that the proposed method is a convergent regularization method.
متن کاملA nonsmooth inexact Newton method for the solution oflarge - scale nonlinear complementarity
A new algorithm for the solution of large-scale nonlinear complementarity problems is introduced. The algorithm is based on a nonsmooth equation reformulation of the complementarity problem and on an inexact Levenberg-Marquardt-type algorithm for its solution. Under mild assumptions, and requiring only the approximate solution of a linear system at each iteration, the algorithm is shown to be b...
متن کامل